Removing Cosmic Spikes Using a Hyperspectral Upper-Bound Spectrum Method
نویسندگان
چکیده
منابع مشابه
A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition
This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into subcircuits, and the upper bound is approximately computed as the sum of maximum switching gates for all subcircuits. In order to increase the accuracy, we adopted an evaluation function that takes account of both the inte...
متن کاملProbabilistic Upper Bound Using Linear Cuts
As a direct extension of the structured singular value framework from the worst-case to the probabilistic robustness analysis, probabilistic deenes a probability measure of performance assuming some distribution on the uncertainty. Exact computation of probabilistic is intractable. Standard branch and bound methods with axially aligned cuts had been applied to compute a hard upper bound for pro...
متن کاملRemoving spikes caused by quantization noise from high-resolution histograms.
A novel method is presented for the removal of spikes, caused by the division of two series of integers, from high-resolution histograms. When two series of integers are divided the results take the form of a nonuniform distribution. Such a division is often used in medical imaging, due to the storage of most images as integers. An example of this is the division of the saturated and unsaturate...
متن کاملRemoving non-stationary noise in spectrum sensing using matrix factorization
Spectrum sensing is key to many applications like dynamic spectrum access (DSA) systems or telecom regulators who need to measure utilization of frequency bands. The International Telecommunication Union (ITU) recommends a 10 dB threshold above the noise to decide whether a channel is occupied or not. However, radio frequency (RF) receiver front-ends are non-ideal. This means that the obtained ...
متن کاملA Sharp Upper Bound on Algebraic Connectivity Using Domination Number
Let G be a connected graph of order n. The algebraic connectivity of G is the second smallest eigenvalue of the Laplacian matrix of G. A dominating set in G is a vertex subset S such that each vertex of G that is not in S is adjacent to a vertex in S. The least cardinality of a dominating set is the domination number. In this paper, we prove a sharp upper bound on the algebraic connectivity of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Spectroscopy
سال: 2016
ISSN: 0003-7028,1943-3530
DOI: 10.1177/0003702816668528